Rate matching method in mobile communication system

ABSTRACT

A rate matching method is provided for a mobile communication system that performs an adjustment to a code rate based on an optimal level by puncturing or repetition to respective bit streams of transport channels. The rate matching method is preferably applicable to uplink and downlink rate matching for channel coding including turbo coding, convolutional coding and the like. The rate matching method for uplink can include executing coding for bits of a transport channel, and branching off the bits into a plurality of sequences, constructing a first interleaving pattern for the plurality of sequences, constructing a virtual interleaving pattern for at least one sequence based on a mapping rule with a corresponding first interleaving pattern and calculating different bit shifting values in each column of each virtual interleaving pattern. Then, a bit position to be punctured is determined in each constructed virtual interleaving pattern using the calculated bit shifting values.

RELATED APPLICATIONS

This application is a continuation of application Ser. No. 10/622,781, filed on Jul. 21, 2003, now U.S. Pat. No. 7,089,480 which is a continuation of application Ser. No. 09/615,603, now U.S. Pat. No. 6,622,281, filed on Jul. 13, 2000.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to the next generation mobile communications, and more particularly, to a rate matching method for the next generation mobile communication system.

2. Background of the Related Art

The ARIB of Japan, ETSI of Europe, T1 of U.S.A., TTA of Korea and TTC of Japan mapped out a more advanced next generation mobile communication system based on a radio access technique and a core network technique of the existing global system for mobile communications (GSM) that services multimedia such as sound, an image and data. The parties agreed with joint researches to present a technical specification for the advanced next generation mobile communication system, and the project was called a third generation partnership project (hereafter “3GPP”).

The 3GPP is classified into several technical specification groups (TSG). In a research field for a radio access network (RAN) among the TSGs of the 3GPP, a technical specification for an uplink rate matching and a downlink rate matching is provided. The rate matching is realized by adjusting to a code rate level most appropriate to a radio interface through a puncturing process for removing a specific bit or a repetition process for adding a specific bit for a bit stream provided via a channel coding.

Algorithms used in the rate matching can be divided into puncturing algorithms and repetition algorithms. Further, different rate matching algorithms are embodied in an uplink and a downlink, which is the reason why an interleaving for a rate matched bit stream is performed in the downlink and a rate matching for an interleaved bit stream is executed in the uplink.

FIG. 1 is a block diagram showing the structure for an uplink in a conventional 3GPP standard. In the uplink, data streams of several transport blocks having the same quality of service (hereafter “QoS”) have a channel coding execution according to a desired code rate, and then, are branched off into several sequences. These sequences are passed through a procedure of a 1st interleaving in a unit of a code symbol. Such 1st interleaved sequences undergo the rate matching using the puncturing algorithm or the repetition algorithm.

FIG. 2 represents a block diagram showing the structure for a downlink in the conventional 3GPP standard. In the downlink, data streams of several transport blocks having the same as ‘QoS’ have a channel coding execution according to a required code rate, and then, are branched off into several sequences. The sequences of the respective branches undergo rate matching using the puncturing algorithm or the repetition algorithm. Such rate matched sequences have an execution of a 1st interleaving in a unit of a code symbol.

In the channel coding applicable to the transport channel (TrCH) of the uplink or downlink there is a convolutional coding and a turbo coding. However, other specific channel coding may be applied thereto.

A multi-stage interleaver (MIL) is used as an interleaver for performing the 1st interleaving in this uplink or downlink. For reference, the span of the 1st interleaving using the MIL is same as a transmission time interval (TTL) of the TrCH.

The MIL writes a bit stream on an interleaver memory in a unit of a row, reads it in a unit of a column, and constructs an output bit stream. At this time, it is characterized that a rule based on a bit reversing order is applied in an order of reading the interleaver memory.

For example, if the number of column for the 1st interleaver is 8, each column number can be represented with 3 digits. Bit reversing for the column number can be performed in such a way that the column number bit value is reversed, namely, in such a method as ‘0(000)->0(000)’, ‘1(001)->4(100)’, ‘2(010)->2(010)’, ‘3(011)->6(110) etc. and thereby the column bit stream based on an order of “0 4 2 6 1 5 3 7” is outputted by 1st MIL interleaver, instead of an output of the column bit stream based on an order of “0 1 2 3 4 5 6 7”.

The following table 1 represents the order of the column bit stream outputted from the MIL on the basis of respective columns of the interleaver.

TABLE 1 R(k) K R(0) R(1) R(2) R(3) R(4) R(5) R(6) R(7) 2 0 1 4 0 2 1 3 8 0 4 2 6 1 5 3 7 Table 1 shows bit reversing when the number of columns (k) of the interleaver is 2,4 and 8, respectively, and where R(k) indicates a result of a bit reversing.

FIG. 3 provides an order of the column bit stream outputted from the MIL in case that the column number of the interleaver, K, is 8 as shown in Table 1, in an example. Digits represented in shadow blocks of FIG. 3 indicate the order of the column bit stream actually outputted from the interleaver.

One code symbol in a turbo coder is constructed with a systematic bit, a 1st parity bit and a 2nd panty bit. The first parity bit represents output bits of an upper Recursive Systematic Convolutional Coder (RSC coder), and the second parity bit indicates output bits of a lower RSC coder. In contrast to the convolutional code, in the turbo code an importance of the three bits constructing the code symbol is different among one another.

In other words, among the systematic sequence, the 1st parity sequence and the 2nd parity sequence turbo-coded and branched off, the systematic sequence is relatively important and the remaining parity sequences decrease in importance, when decoding. Therefore, a method is needed for excluding the puncturing for the systematic sequence and puncturing mutually equally only for the remaining parity sequences, in the puncturing technique for the turbo code.

A conventional puncturing algorithm for the turbo code in the downlink is described in the following. For the turbo code in the downlink the puncturing is generated in a unit of a code symbol, differently from the convolutional code basically generating the puncturing in a unit of a code bit.

One example out of the puncturing algorithms for the turbo code in the downlink provides that a puncturing position of the code symbol unit is decided so as to constantly perform the puncturing in the code symbol unit, and after that, the parity sequences on a corresponding code symbol position are alternately punctured. In another puncturing algorithm for the turbo code in the downlink, a position having the puncturing occurring in the code symbol unit is extended by twice distance, and after that, the parity sequences are simultaneously punctured every a code symbol in which each puncturing occurs.

Such puncturing algorithms for the turbo code are considered in the downlink. Since the puncturing procedures for the turbo code of the downlink occurs before the interleaving, the puncturing can be performed independently from the interleaving procedure.

However, if the puncturing algorithm for the turbo code are considered in the uplink, the puncturing procedure for the rate matching should be performed after the interleaving. Thus, additional terms need to be considered in comparison with the downlink.

As described above, the related art uplinks and downlinks in the 3GPP standard have various disadvantages. That is, parameters used in the puncturing procedure for the turbo code in the downlink cannot be used as is, and other and/or additional parameters should be used to satisfy a uniform puncturing of a code bit unit having a consideration for the interleaving. In other words, for a uniform amount for the respective interleaved column bit stream to be punctured, parameters are needed so that the puncturing may be uniformly generated even for the bit stream before the interleaving.

However, it is the present situation such a puncturing technique for such turbo code of the uplink is not yet considered and needed. Further, when the parameter used in the existing downlink is used in the uplink without change, even in the repetition procedure for the turbo code, a problem is caused that only a stream of a specific row is repeated. Also, it is the present situation that a rate matching method is needed that is applicable to all of a channel code such as the turbo code and the convolutional code etc. and channel codes used in the uplink and downlink.

The above references are incorporated by reference herein where appropriate for appropriate teachings of additional or alternative details, features and/or technical background.

SUMMARY OF THE INVENTION

An object of the present invention is to solve at least the above problems and/or disadvantages and to provide at least the advantages described hereinafter.

Another object of the present invention is to provide a rate matching method of a mobile communication system that substantially obviate one or more of the limitations and disadvantages of the related art.

Another object of the present invention is to provide an improved rate matching method of providing a uniform puncturing pattern and a uniform repetition pattern for each bit stream of TrCHs supplying mutually different services in the next generation mobile communication system using a Wideband Code Division Multiple Access (hereafter “W-CDMA”) method.

In order to achieve at least the above-described objects of the present invention in a whole or in parts, there is provided a rate matching puncturing method in a mobile communication system that includes (a) performing a channel coding for bits of a transport channel and outputting one or more channel-coded sequences, (b) constructing a first interleaving pattern based on a unit of a symbol for each of the channel-coded sequences, (c) constructing virtual interleaving patterns for said each of the channel-coded sequences by considering a mapping rule with a corresponding first interleaving pattern, (d) calculating different bit shifting values in each column of the constructed virtual interleaving patterns and determining a bit position to be punctured, and (e) puncturing bits in each first interleaving pattern constructed in (c), based upon (d).

To further achieve at least the above-described objects of the present invention in a whole or in parts, there is provided a rate matching method for uplink in a mobile communication system that includes executing in a frame unit a turbo coding for bits of a transport channel, and branching off the bits into a systematic sequence, a first parity sequence and a second party sequence, constructing a first interleaving pattern based on a unit of a symbol for the branched-off sequences, constructing a virtual interleaving pattern for each parity sequence turbo-coded by considering a mapping rule with a corresponding first interleaving pattern, calculating different bit shifting values in each column of each virtual interleaving pattern, deciding a bit position to be punctured in each constructed virtual interleaving pattern by using the calculated bit shifting values, and puncturing bits according to the decided bit position to be punctured.

To further achieve at least the above-described objects of the present invention in a whole or in parts, there is provided a sequence repetition method for an uplink rate matching, in a mobile communication system including performing in a frame unit a channel coding for bits of a transport channel, constructing a first interleaving pattern based on a unit of a symbol calculating a mean repetition distance according to a prescribed bit repetition rate using a mapping rule with the constructed first interleaving pattern, computing different bit shifting values based on respective columns in the constructed first interleaving pattern by using the mean repetition distance, and deciding a repetition bit position in the constructed first interleaving pattern by using a corresponding bit shifting value.

To further achieve at least the above-described objects of the present invention in a whole or in parts, there is provided

Additional advantages, objects, and features of the invention will be set for in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and advantages of the invention may be realized and attained as particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail with reference to the following drawings in which like reference numerals refer to like elements wherein:

FIG. 1 represents a block diagram showing a portion of structure for a related art transport channel multiplexing an uplink according to a 3GPP standard;

FIG. 2 represents a block diagram showing a portion of structure for a related art transport channel multiplexing a downlink according to a 3GPP standard;

FIG. 3 illustrates an exemplary order of a column bit stream outputted from a MIL when the column number of an interleaver is ‘K=8’;

FIG. 4 is a block diagram showing a preferred embodiment of an uplink rate matching procedure in accordance with the present invention;

FIG. 5 depicts a block diagram providing construction of an exemplary channel encoder of FIG. 4;

FIG. 6 sets forth an interleaving pattern of an MIL in case that the column number of a used interleaver is ‘K=8’;

FIGS. 7 a-7 b are diagrams that show an exemplary virtual interleaving pattern for two coded parity sequences;

FIGS. 8 a-8 f show puncturing patterns generated by another preferred embodiment of an uplink rate matching procedure according to the present invention concerning of the virtual interleaving patterns shown in FIGS. 7 a-7 b;

FIGS. 9 a-9 c are diagrams that show exemplary puncturing patterns of virtual interleavers applied to a 1st interleaving pattern;

FIGS. 10 a-10 c are diagrams that show puncturing patterns generated by another preferred embodiment of an uplink rate matching procedure according to the present invention of the virtual interleaving pattern shown in FIG. 7 when the quantity of puncturing per column of a 1st interleaver is an odd number;

FIGS. 11 a-11 c are diagrams that show puncturing patterns generated by another preferred embodiment of an uplink rate matching procedure in accordance with the present invention when a quantity of puncturing per column of a 1st interleaver is an odd number;

FIG. 12 is a diagram that shows another puncturing pattern generated by another preferred embodiment of a rate matching procedure based on an optimal level applied to a 1st interleaving pattern when a quantity of puncturing per column of a 1st interleaver is an odd number;

FIGS. 13 a-13 b are diagrams that show a puncturing pattern for a turbo code provided by controlling a parameter ‘a’ according to a preferred embodiment of the rate matching procedure based on an optimal level of the present invention;

FIGS. 14 a-14 b are diagrams showing puncturing patterns on a virtual interleaver though two various shifting parameter calculations when an overall puncturing more than 33.3% is generated, namely, in case a puncturing over 50% for each parity sequence is generated; and

FIGS. 15 a-15 b are diagrams that show a repetition pattern.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Initially, two decoders that are used in a system utilizing a turbo code will be described. Two decoders are positioned on both ends of an interleaver in turbo decoder, and code bits inputted to first and second decoders are respectively provided with elements of a 1st parity sequence and a 2nd parity sequence. In order to improve an overall performance of the turbo decoder, it is important that two decoders each have an equal decoding capability. In an aspect of one decoder, also, it is important in increasing or maximizing a performance of the decoder that a puncturing on an input parity sequence of the decoder occurs by a uniform interval.

Therefore, it is very important that the puncturing based on the uniform quantity should influence upon the 1st parity sequence of an upper RSC and the 2nd parity sequence of a lower RSC by considering such characteristic of the decoding procedure in a transmitting side, and the puncturing based on a uniform interval should influence upon the respective parity sequences.

Accordingly, a preferred embodiment of a puncturing method for a turbo code of an uplink according to the present invention preferably satisfies the following conditions. First, a punching for a systematic sequence element is excluded. Second, for parity sequence elements, the puncturing based on the uniform quantity is generated from elements of the first and second parity sequences. Third, in an overall bit column before a 1st interleaving is performed in a unit of a code symbol, a position of the puncturing on each parity sequence has a uniform interval.

In addition to these three conditions, one additional condition should be considered, namely, a specific characteristic of an uplink. Thus, a puncturing by the same quantity is generated for all radio frames passed through the interleaving. That is, a uniform code bit for respective interleaved column bit streams is punctured.

In the preferred embodiments according to present invention, puncturing the turbo code provided in the uplink satisfies the above conditions.

Preferred embodiments of the puncturing procedure for a turbo code rate matching of an uplink will now be described in accordance with the present invention. For convenience, a case that the number of columns, K, in an interleaver is ‘8’ will now be described. The present invention is, of course, not intended to be so limited and is applicable to other cases such as when the number of columns, K, in the interleaver is 1, 2, 4.

FIG. 4 sets forth a block diagram showing a first preferred embodiment of an uplink rate matching procedure based on an optimal level in accordance with the present invention. FIG. 5 provides a block diagram showing additional detail of a channel encoder that can be used in FIG. 4.

In a case of ⅓ rate turbo coding, x is an output of a channel encoder 10 is a systematic sequence, y is a 1st parity sequence, and z is a 2nd parity sequence generated in the lower RSC encoder through an input of a turbo-interleaved systematic sequence. These branched-off sequences are provided as outputs in the turbo coding result for the TrCH, and are then passed through the 1st interleaving, where the 1st interleaving is preferably performed for one sequence obtained by multiplexing the branched-off sequences.

Two parity sequences y,z among the turbo-coded outputs are outputs of respective RSC coders 12,13.

In particular, each independent virtual interleaving pattern is constructed for a 1st parity sequence (y) element and a 2nd parity sequence (z) element among three sequences passed through the 1st interleaving. Preferably, the construction is performed in a bit selection block 30. A rate matching block (RMB) 40 can separately apply the same puncturing process or algorithm to two individual virtual interleaving patterns constructed in the bit selection block 30.

FIG. 6 indicates an interleaving pattern of a 1st interleaver 20 when the column number, K, of the interleaver used in the first preferred embodiment is 8, and FIGS. 7 a-7 b depict virtual interleaving patterns for two coded parity sequences. In particular, FIG. 7 a shows a virtual interleaving pattern for the 1st parity sequence element, and FIG. 7 b presents a virtual interleaving pattern for the 2nd parity sequence element.

In FIG. 7, digits provided on the upper shadow portions represent column numbers on an original 1st interleaver of FIG. 6. In other words, it shows a relation between column numbers on the virtual interleaver and column numbers on the actual 1st interleaver.

The rate matching block (RMB) 40 in the first preferred embodiment of a puncturing process for a turbo code of an uplink basically uses the following two procedures so that the puncturing based on each uniform quantity in two virtual interleavers with such construction may be generated by a uniform interval on a sequence before the virtual interleaving. First shifting parameters per column of each virtual interleaving pattern are calculated. Second, the first calculated shifting parameter per column is applied to an actual puncturing algorithm for an original interleaving pattern. That is, the shining parameters per each column of the virtual interleaving pattern are computed, and this is mapped to the shifting parameter for each column of the 1st interleaving pattern.

The RMB 40 is used in a process in which the puncturing is performed by the P number of bits every individual column sequence having a bit length of N_(C) in the 1st interleaving pattern shown in FIG. 6. Thus, for the 1st parity sequence element having a bit length of an N_(C)/3 in every respective column, the puncturing is performed by the P/2 number of bits. For the 2nd parity sequence element having the bit length of the N_(C)/3 in every respective column, the puncturing is also performed by the P/2 number of bits.

At this time, as described above, the RMB 40 separately applies the same puncturing process to two respective virtual interleaving patterns constructed in the bit selection block 30, namely, to the respective parity sequence elements. For that, first, an initial error offset value e_(ini) should be gained for each column of the 1st interleaver 20. In order to gin the initial error offset value e_(ini), the shift parameter to be applied to each column of an interleaver memory should be calculated respectively by a first parameter determination method or algorithm and a second parameter determination method or algorithm.

The first parameter determination algorithm and the second parameter determination algorithm for calculating shifting parameters S1,S2 to be used in the puncturing algorithm for the first and second parity sequence elements will now be described.

In the first parameter determination process for computing the shifting parameter S1 for the first parity sequence element, when each column in the 1st interleaver is constructed by the bit length of N_(C) as shown in FIG. 6 and the puncturing by the P number of bits is performed in every respective column, the following preconditions are required. In the following described procedures, it is first assumed for an explanatory convenience that P has only a value of an even number. A generation for a P value of an odd number will be described later.

First, a number of code symbol N=└N_(C)/3┘: herewith, a character └x┘ indicates the maximum integer value that is not over x, which means a cut-off under a decimal point of x. N is not an actual code symbol but is regarded as the code symbol.

Second, the number of code symbols after the puncturing, N _(i) =N−P/2  (1)

Third, q=└N/|N_(i)−N|┘; wherein q represents an average puncturing distance of the code symbol unit.

When q is calculated in the above preconditions, the first parameter determination algorithm for calculating the shifting parameter S1 applicable to each column from the calculated q value is represented as follows.

“if(q≦2) { for(k=0; k < K; k++) { if((k mod 2)==0) S₁[R[(3k+1)mod K]] = 0; else S₁[R[(3k+1)mod K]] = 1; } } else { if(q is even) $q^{\prime} = {q - \frac{{GCD}\left( {q,K} \right)}{K}}$ else q′ = q for(i=0; i<K; i++) { k = ┌i*q′┐mod K ; S₁[R[(3k + 1)mod K]] = ┌i*q′┐divK; } }”

In the above first parameter determination algorithm,

$\,{\,{``{q^{\prime} = {q - \frac{{GCD}\left( {q,K} \right)}{K}}}"}}$ is provided to prevent a consecutive puncturing in the same column, wherein “GCD(q,K)” indicates the greatest common divisor, and “R[(3k+1)mod K]” is the expression provided by considering a mapping from the virtual interleaving pattern to the actual first interleaver and a relation between the respective columns of the first interleaver and an order of radio frames.

“S₁[R[(3k+1)mod K]]=┌i*q′┐divK” is the expression provided to compute the shifting parameter S1 per radio frame resultantly, where a character ┌x┐ indicates the minimum integer value that is more than x.

In the second parameter determination process for computing the shifting parameter S2 for the second parity sequence element, when each column of the 1st interleaver is constructed by the bit length of N_(C) as shown in FIG. 6 and the puncturing by the P number of bits is performed every respective column, the following preconditions are preferably requited.

First, a code symbol N=└N_(C)/3┘: herewith, └x┘ is the maximum integer value which is not over x, which means a cut-off under a decimal point of x, and N is not an actual code symbol but is regarded as the code symbol.

Second, the number of code symbols after the puncturing is, N _(i) =N−P/2  (2) Third, q=└N/|N_(i)−N|┘; wherein q represents an average puncturing distance of the code symbol unit.

When q is calculated in the above preconditions, the second parameter determination algorithm for calculating the shifting parameter S2 applicable to each column from the calculated q value is represented as follows.

“if(q≦2) { for(k=0; k < K; k++) { if((k mod 2)==0) S₂[R[(3k+2)mod K]] = 0; else S₂[R[(3k+2)mod K]] = 1; } } else { if(q is even) $q^{\prime} = {q - \frac{{GCD}\left( {q,K} \right)}{K}}$ else q′ = q for(i=0; i<K; i++) { k = ┌i*q′┐mod K ; S₂[R[(3k + 2)mod K]] = ┌i*q′┐divK; } }”

In the above second parameter determination algorithm,

$``{q^{\prime} = {q - \frac{{GCD}\left( {q,K} \right)}{K}}}"$ is provided to prevent a consecutive puncturing in the same column, wherein “GCD(q,K)” indicates the greatest common divisor, and “R[(3k+2)mod K]” is the expression provided by considering a mapping from the virtual interleaving pattern to the first actual interleaver and a spatial relation between the respective columns of the first interleaver and an order of radio frames.

“S₂[R[(3k+2)mod K]]=┌i*q′┐divK” is the expression provided to compute the shifting parameter S2 per radio frame resultantly, wherein the character ┌x┐ indicates the minimum integer value more than x.

The shifting parameters S1,S2 are calculated for each column by such above parameter determination algorithms. Then, the following rate matching process or algorithm for the puncturing is performed by using the initial error offset value e_(ini) gained therefrom.

A computation procedure of the initial error offset value e_(ini) for the first parity sequence element and a computation procedure of the initial error offset value e_(ini) for the second parity sequence element are applied separately to the rate matching puncturing algorithm. According to preferred embodiments of the present invention, the following rate matching puncturing algorithm preferably requires following basic preconditions.

First, N_(C): number of data bits in each column of the 1st interleaver. Second, P=maximum amount of puncturing allowed per each column in the 1st interleaver.

Third, N=└N_(C)/3┘: determines the number of bits for each parity bit sequence and determines number of executions in the following loop. Fourth, the number of code symbols after the puncturing: N_(i)(1st parity sequence: the expression (1), 2nd parity sequence: the expression (2)). Fifth, k is the radio frame numbers of the first interleaver, {k=0,1,2,3, . . . , K−1}, wherein K is the number of columns in the first interleaver.

“if the puncturing is to be performed

y=(N−N_(i)); the number of puncturing bits

e_(ini)=(a*S_(i)(k*y+N)mod (a*N); wherein j is 1 for the 1st parity sequence and 2 for the 2nd parity sequence.

  if(e_(ini)=0)  e_(ini) = a*N   e = e_(ini)   m = 1 ; index of current bit   do while m <= N    e = e − a*y ; update error   if e <= 0 then ;check if bit number m should be punctured puncture m-th bit from each parity sequence    e = e+ a*N  ; update error  end if   m = m + 1 ; index of next bit end do”

Such above procedure is called as a pattern determination algorithm of the rate matching. Several puncturing patterns according to preferred embodiments can be obtained by providing differing values of ‘a’ in the pattern determination algorithm. For example, in a case of a convolutional code, 2 is used as ‘a’ value. But, in a case of the turbo code, mutually different ‘a’ values for the first and second party sequences cm be used. In other words, ‘a=2’ can be used for the first parity sequence and ‘a=1’ can be used for the second panty sequence. Alternatively, ‘a=1’ can be used for the first panty sequence and ‘a=2’ can be used for file second part sequence. Also, ‘a=2’ may be used for both the first and second parity sequences.

FIGS. 8 a-8 f are diagrams that show puncturing patterns generated by the first preferred embodiment of the inventive uplink rate matching procedure, concerning of the virtual interleaving pattern shown in FIGS. 7 a-7 b. However, the present invention is not intended to be so limited. FIG. 8 a shows the puncturing pattern of the virtual interleaver for the first parity sequence (y) element, and FIG. 8 b shows the puncturing pattern of the virtual interleaver for the second party sequence (z) element. In this example, it is supposed that an application to all of the first and second parity sequences is possible by fixing the ‘a’ value as 2.

FIG. 8 c is a diagram that represents the puncturing pattern on the vial interleaver of the first parity sequence in case that the ‘a’ value is as ‘1’. FIG. 8 d is a diagram that represents the puncturing pattern on the virtual interleaver of the second parity sequence in case that ‘a’ value is as ‘2’. FIG. 8 e is a diagram that provides the puncturing pattern on the virtual interleaver of the second parity sequence in case that the ‘a’ value is as ‘2’. FIG. 8 f is a diagram that shows the puncturing pattern on the virtual interleaver of the second parity sequence in case that the ‘a’ value is as ‘1’.

FIGS. 9 a-9 c are diagrams that show an overall puncturing pattern in case that the puncturing pattern of each virtual interleaver shown in FIGS. 8 a-8 f is actually applied to the first interleaving pattern. FIG. 9 a shows the puncturing pattern of a case of fixing the ‘a’ value as ‘2’ and using it for the first and second parity sequences. FIG. 9 b is for the puncturing pattern of a case of using the ‘a’ value as each of 1 and 2 for the first and second parity sequences. FIG. 9 c is the puncturing pattern for a case that the ‘a’ value is used as each of 2 and 1 for the first and second parity sequences.

FIGS. 9 a-9 c provide a case that the first interleaved whole bit number is 288 and 32 bus among them are punctured. In the above preferred embodiments of the rate matching algorithm, 4 bits based on each column of the first interleaving pattern are punctured. That is, 4 bits among 32 bits (288/8) of each column are punctured.

In comparing such case with the virtual interleaving pattern for each panty sequence elements as shown in FIGS. 7 a-7 b, respectively, two bits per each column are each punctured in each virtual interleaving pattern. In other words, 2 bits among 12 bits (96/8) of each column are punctured.

The inventive rate matching puncturing procedure for the turbo code of the uplink according to the first preferred embodiments which was described above, is preferably for the case that the puncturing occurs so that a target code rate may become under ½, and is also for the case that the puncturing bit number is an even number bit for each column of the first interleaver. However, the present invention is not intended to be so limited. For example, an odd number bit can be punctured per each column for the first interleaved overall bit column. Accordingly, a preferred embodiment of a procedure for puncturing based on an optimal level will now be described for cases that the target code rate is under ½ and the puncturing bit number is the odd number bit in each column of the first interleaving pattern. FIGS. 10 a-10 c provide puncturing patterns generated by uplink rate matching procedure concerning of the virtual interleaving pattern shown in FIGS. 7 a-7 b in case that the quantity of puncturing per column of a 1st interleaver is an odd number. Different from in FIGS. 9 a-9 c where an even number bit is punctured for each column of the first interleaving pattern, FIG. 10 shows the case that the odd number bit is punctured for each column of the first interleaved pattern.

Further in FIGS. 9 a-9 c, 32 bits for the first interleaved overall bit column are punctured. Namely, 4 bits per each column are punctured.

However, 24 bits for the first interleaved overall bit column are punctured in the preferred embodiment shown in FIGS. 10 a-10 c. Namely, 3 bits pet each column should be punctured.

Therefore, if performed using the above-described parameter determination algorithm, 1.5 bits should be punctured for each of the first and second parity sequence elements. But since that is actually impossible, complementary methods will now be described.

Solving such problems will now be described using three methods according to preferred embodiments of the present invention. In a first method, in case three bits for each column of the first interleaving pattern should be punctured, it is the method of puncturing two bits by ┌1.5┐=2 on the first parity sequence and also puncturing one bit by └1.5┘=1 on the second parity sequence. In this case, the above-mentioned expressions (1) and (2) should be preferably generalized as follows. N _(i) =N−┌P/2┐  (1′); 1st parity sequence, and N _(i) =N−└P/2┘  (2′); 2nd parity sequence.

In a second method, it is the method of embodying the parameter determination algorithm so that one bit is punctured by └1.5┘=1 on the first parity sequence and two bits are punctured by ┌1.5┐=2 on the second parity sequence. In this case, the above-described expressions (1) and (2) should be generalized as follows. N _(i) =N−└P/2┘  (1′); 1st parity sequence, and N _(i) =N−┌P/2┐  (2′); 2nd parity sequence.

In other words, in embodying the parameter determination algorithm, for the remaining first and second parity sequences excepting of the systematic sequence among sequences outputted after the turbo coding, in case a pre-decided puncturing bit number is P, the ┌P/2┐ number of bits are punctured for the first parity sequence and the └P/2┘ number of bits are punctured for the second parity sequence. Alternatively, the └P/2┘ number of bits are punctured for the first parity sequence and the ┌P/2┐ number of bits are punctured for the second parity sequence.

However, problems can occur when the shifting parameter is calculated and the puncturing is performed by such method. That is, in case that the quantity of puncturing, P, is an odd number if the └P/2┘ number of puncturing is performed on the first parity sequence and the ┌P/2┐ number of puncturing is performed on the second parity sequence, there exists a difference caused in the puncturing number by the number of columns of the first interleaver in an overall aspect. In other words, if the number of columns of the first interleaver is K, the overall puncturing quantity of the 1st party sequence becomes a smaller quantity by K at maximum in comparison with the puncturing quantity of the 2nd panty sequence. That is, the puncturing on the first and second sequences each has a uniform puncturing interval, but its puncturing interval becomes mutually different on the 1st and 2nd parity sequences. In this example, the puncturing interval on the first parity sequence has a larger value in comparison with the puncturing interval on the second parity sequence. However, the difference of the puncturing quantity by K at maximum does not significantly influence the whole performance of the turbo decoder.

FIGS. 10 a-10 b show resultant puncturing patterns when the number of punctures P is 3 for cases that the └P/2┘=1 number of puncturing is performed on the first parity sequence and the ┌P/2┐=2 number of punctures are performed on the second party sequence. Herewith, it is assumed that the ‘a’ value is applied as 2 for all of the 1st and second parity sequences. FIG. 10 a shows the puncturing pattern on the virtual interleaver for the 1st party sequence, and FIG. 10 b shows the puncturing pattern on the virtual interleaver for the 2nd party sequence. FIG. 10 c provides a resultant puncturing pattern on the 1st interleaver.

FIGS. 11 a-11 b provide the resultant puncturing pattern when the number of punctures P is 3 for cases that the ┌P/2┐=2 number of punctures are performed on the first parity sequence and the └P/2┘=1 number of puncturing is performed on the second parity sequence. FIG. 11 a shows the puncturing pattern on the virtual interleaves for the 1st parity sequence, and FIG. 11 b shows the puncturing pattern on the virtual interleaver for the 2nd parity sequence. FIG. 11 c indicates a resultant puncturing pattern on the 1st interleaver.

In the third method, when the quantity of punctures per column is P, a bit shifting value on the virtual interleaver is calculated though the puncturing quantity of ┌P/2┐. An initial error offset e_(ini) of each RMB is computed by using such calculated bit shifting value S1 and S2. In each RMB, the rate matching puncturing is performed by using this computed e_(ini) value so as to generate the puncturing of ┌P/2┐. In this case, the above-described expressions (1) and (2) can be expressed as follows. N _(i) =N−┌P/2┐  (1′″); 1st parity sequence, and N _(i) =N−┌P/2┐  (2′″); 2nd parity sequence.

After that, the rate matching pattern determination algorithm is executed so that the puncturing of a partial bit, which is 1 bit in this case, is excluded for the 1st or 2nd parity sequence. The quantity of such executed overall puncturing should be P*K. In order to satisfy such requirements, several methods can be used. Describing an initial method, the puncturing for one bit on the first parity sequence is excluded, for columns in an order of the even number of the 1st interleaver. Meantime, in columns based on the order of an odd number, the puncturing for one bit on the second parity sequence is excluded. When such procedures are repeated, on the even numbered columns of the interleaver, the puncturing is increased by 1 bit on the second parity sequence relative to the 1st parity sequence. On the odd numbered columns, the puncturing is more by 1 bit on the first parity sequence relative to the second parity sequence. Further, an opposite method to this can be considered according to the present invention. However, a new logic for excluding the 1 bit puncturing per each interleaver column is needed. One method for this logic according to the preferred embodiments is to provide a puncturing position to be excluded (e.g., as a final puncturing position) when the puncturing per each column is performed on each parity sequence.

In an execution another preferred embodiment of the rate matching algorithm for the K/2 number of columns before the 1st interleaving pattern, a final puncturing on the 1st parity sequence is excluded, and for the post K/2 number of columns, a final puncturing on the 2nd parity sequence is excluded. Again the opposite case can also be used.

FIG. 12 is a diagrams that shows the puncturing pattern for a case of using the above described third method, in performing the puncturing of 3 bits per each column. That is, the method is used for that the puncturing pattern of each virtual interleaver is gained by ┌P/2┐=2, after that, in an actual puncturing procedure the final puncturing of the 1st parity sequence is excluded in the even numbered columns and the final puncturing of the 2nd parity sequence is excluded in the odd numbered columns.

In the above-described third method, the puncturing quantity on each parity sequence preferably always has an equal value with each other, regardless of that the puncturing number P per each column of the 1st interleaver is the odd number or the even number. But this method can have a shortcoming. Thus, an additional logic is needed for excluding the final puncturing of any panty sequence per column. Another shortcoming is the puncturing requirement for a uniform interval on each parity sequence is not satisfied. That is, since the final puncturing is excluded according to a case of each column, it can be noted that a uniformity in the puncturing interval is upset in an aspect of the sequence before an original interleaving, as shown in FIG. 12.

The above-mentioned three methods can settle a problem caused when the puncturing number P per each column of the 1st interleaver is an odd number. Three methods all have the respective advantages, merits can have shortcomings. But one of the above first and second methods may be more preferable, considering a complication caused by an addition of a logic and a trade-off between performance.

In addition, the preferred embodiments were described above centering on the uniform puncturing for the turbo code. However, the present invention is not intended to be so limited.

The above-described parameter determination process and the rate matching puncturing process are applicable even to a case that the channel encoder performs the convolutional coding. For example, according to another preferred embodiment of the inventive rate matching procedure, the puncturing algorithm for the convolutional code of the existing bit unit is used as it is, and also, the puncturing position based on a uniform interval on each part sequence can be designated. Therefore, the uniform puncturing for the turbo code of the uplink is realized.

A procedure for deciding an optimal parameter so as to get the uniform puncturing pattern for a channel code such as the turbo code and the convolutional code etc. on the basis of the above-described preferred embodiments of the rate matching puncturing algorithm will now be described. Further, preferred embodiments of a rate matching puncturing procedure applicable to all of the channel code used in the uplink and the channel code used in the downlink will now be described.

Before additional inventive detailed description, the RMB in FIG. 4 performs that algorithm by applying several sequences branched off, to the following rate matching algorithm, according to a target code rate. The CAB can use several parameters. The parameters used according to the target code rate include a parameter representing the number of bits for each branched off input sequence, a parameter indicating a bit quantity punctured on each branched off bit stream passed through a channel coding and a parameter used in adjusting a pattern of the puncturing, for example.

If the RMB has an input of the turbo-coded sequences, the punching for the systematic sequence is excluded. Thus, a parameter value representing the puncturing bit quantity becomes ‘0’, and the parameter value indicating the puncturing bit quantity for the first and second parity sequences becomes respectively ┌P/2┐ or └P/2┘.

In the above-described preferred embodiments of rate matching algorithm for the turbo code of the uplink, parameters as shown in table 2 can be used to get the uniform puncturing pattern or a uniform repetition pattern. As shown in table 2, an available combination totals six. In other words, it is available to gain six mutually different puncturing patterns by changing the ‘a’ values and the puncturing quantity for the individual parity sequence.

TABLE 2 systematic 1st parity 2nd parity sequence (x) sequence (y) sequence (z) a 2 2 2 2 1 2 2 1 1 number of puncturing 0 ┌P/2┐ or └P/2┘ ┌P/2┐ or └P/2┘ bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘

Even though any one out of the above six combinations is used in the uplink, there is not a large difference in an overall performance of the turbo decoder. But the preferred embodiments of the rate matching puncturing process can be applied not only to the uplink but also to the downlink by properly controlling the parameter ‘a’ for adjusting the punctured bit position and also is applicable to the convolutional code. For that, preferred embodiments of a RMB can preferably use parameters represented in the following tables 3, 4 and 5.

TABLE 3 systematic 1st parity 2nd parity sequence (x) sequence (y) sequence (z) a 2 1 2 number of puncturing 0 └P/2┘ ┌P/2┐ bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘

Table 3 shows parameters preferably used in an inventive RMB for the turbo code according to the present invention. In an example, in case that ‘a’ is fixed as 2 on all two parity sequences and then it is applied to the rate matching algorithm, a deduction by 2*y from the initial error offset value e_(ini) is consecutively performed. Then, a corresponding bit is punctured when its updated error value satisfies a condition of “e≦0”. After the puncturing, 2*N is added to a final updated error value and the algorithm can preferably operate continuously to determine a bit to be next punctured.

However, when applying parameters of table 3, a bit position initially punctured on the first parity sequence is increased by about twice. If a mean puncturing distance is represented in an integer number, it is increased exactly by twice, which is shown in FIG. 11.

FIG. 13 a depicts the puncturing patterns for the turbo code in case that the parameter ‘a’ used in the inventive optimal rate matching puncturing procedure is used as 2 in all two parity sequences. FIG. 13 b illustrates the puncturing patterns for the turbo code in case that the parameter ‘a’ used in the inventive optimal rate matching procedure is used as 1 for the 1st parity sequence and is used 2 for the 2nd parity sequence.

As known in FIGS. 13 a and 13 b, the parameter ‘a’ for adjusting the puncturing bit position has a application of 1 for the 1st parity sequence and has an application of 2 for the 2nd parity sequence. Therefore, the uniform puncturing for the 1st and 2nd parity sequences is ensured tough the same puncturing algorithm. Of course, the uniform puncturing is satisfied even for the whole parity sequence pair, which is a ½ rate puncturing pattern that is known as Berrou. That is to say, when the parameters shown in table 3 is used, the puncturing pattern of Berrou can be embodied through the rate matching puncturing procedure.

Tables 4 and 5 show parameters usable in the RMB for the convolutional code.

TABLE 4 557₈ 663₈ 711₈ sequence (x) sequence (y) sequence (z) a 2 1 2 number of puncturing P 0 0 bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘

TABLE 5 557₈ 663₈ 711₈ sequence (x) sequence (y) sequence (z) a 2 1 2 number of puncturing ┌P/2┐ └P/2┘ 0 bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘ For ⅓ rate convolutional code being currently used in 3GPP standard, a channel encoder uses “557₈=101101111₂”, “663₈=110110011₂”, and “711₈=111001001₂” polynomials.

Preferably, the sequence outputted by the “557₈=101101111₂” polynomial is ‘x’, the sequence outputted by “663₈=110110011₂” polynomial is ‘y’, and the sequence outputted by “711₈=111001001₂” polynomial is ‘z’. In a preferred embodiment of a rate matching algorithm for the convolutional code, uniform puncturing for the channel-coded overall bit stream is performed. This is based on the condition that all the respective output sequences have the same importance in a case of executing the convolutional coding. In contrast, the systematic sequence among the output sequences of the channel encoder has a higher importance in comparison with the first and second parity sequences when the channel encoder performs the turbo coding.

However, even when the channel encoder actually performs the convolutional coding, each output sequence has different influences upon an overall hamming weight. Consequently, in order for a more efficient performance, it is preferably necessary to exclude a puncturing for a specific sequence having higher importance among the convolutionally coded output sequences.

Currently, it is desirable to exclude the puncturing for the sequence ‘z’ outputted by “711₈=111001001₂” polynomial among the tree output sequences x,y,z coded convolutionally. Accordingly, in preferred embodiments of the present invention, the parameters of table 4 are used so as to perform the puncturing only for the sequence ‘x’ outputted by “557₈=101101111₂” polynomial. In another inventive example, the parameters of Table 5 are used so as to execute alternately the punctures for the sequence ‘x’ outputted by “557₈=101101111₂” polynomial and the sequence ‘y’ outputted by “663₈=110110011₂,” polynomial.

Parameters shown in the tables 6 and 7 can be used selectively according to the present invention when the channel encoder performs the convolutional coding.

TABLE 6 557₈ 663₈ 711₈ sequence (x) sequence (y) sequence (z) a 2 2 1 number of puncturing P 0 0 bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘

TABLE 7 557₈ 663₈ 711₈ sequence (x) sequence (y) sequence (z) a 2 2 1 number of puncturing ┌P/2┐ └P/2┘ 0 bits sequence length └N_(c)/3┘ └N_(c)/3┘ └N_(c)/3┘ Thus, the same rate matching puncturing algorithm can be used in the uplink and downlink by controlling and using the parameters in the preferred embodiments of the inventive rate matching puncturing procedure. Further, the same rate matching puncturing algorithm can be used for the turbo and convolutional code. In particular, a specific logic is not needed for excluding of the puncturing when applying the parameters above.

As described above, the preferred embodiment of a method of constructing the parameters was described to gain the uniform puncturing pattern in the uplink. In the above procedure, the puncturing for the overall bit column operates until 33.3% without any difficulty. If a puncturing over 33.3% occurs such as when the target coding rate to be obtained tough the rate matching puncturing is more than ½, the puncturing for each parity sequence is generated over 50% respectively. A mean puncturing distance q based on the code symbol unit for each parity sequence is gotten by “q=└N/|N_(i)−N|┘”, and thus a value less than 2 is obtained.

As described hereafter, ΔN is defined as the amount of rate matching. If the number of input bit to the rate matching block is N and ΔN amount of rate matching is performed in the rate matching block, the resultant output from RMB has a length of N+ΔN. In the above, N_(i) can be represented as N+ΔN. Therefore, if ΔN has a negative sign, then it means |ΔN| amount of puncturing should be imposed in the RMB. Otherwise, ΔN amount of repetition should be imposed in the RMB. Accordingly, ΔN is now a signed value.

When q has a value less than 2, it is determined in the related art that the shifting parameter value for each radio frame alternately has 0 and 1. Further, in the base process of the preferred embodiments, the puncturing operates well only in a case that a ratio between N and |ΔN| is near 2. The smaller its ratio is from 2, the less the uniformity of the puncturing patterns becomes. That is, though the uniform puncturing for each column is generated, the uniform puncturing condition for the sequence before virtual interleaving is not satisfied.

In an inventive example according to the preferred embodiments, when the punch rate for an overall bit column is over 33.3% in the rate matching procedure, namely, in case that the puncturing over 50% each influences upon two parity sequences, the shifting value is calculated by exchanging a concept for a bit position having a generation of the puncturing and a bit position not having a generation of the puncturing to gain more uniform puncturing pattern. In particular, the number of bits not having a generation of the puncturing is applied to a calculation of the shifting parameters.

In preferred embodiments when puncturing over 50% should influence upon each parity sequence, a new parameter R is defined by a modified modulo operation so that more uniform puncturing may be generated, and a range of the puncturing is preferably computed by using is parameter R. Here, modulo operation on negative value is defined in a circular manner, which means, ΔN mod N≡N−|ΔN|, if ΔN is negative.

According to the present invention, in cases that the puncturing over 50% is generated and the puncturing under 50% is generated, respectively, for two parity sequences, each parameter q that represents a mean puncturing distance of the code symbol unit is computed differently from each other. Finally, the shifting parameters are calculated by the mutual differently computed ‘q’ according to the puncturing rate and it is used for the rate matching puncturing algorithm.

In the above generalized rate matching algorithm, the parameter q indicating the average puncturing distance of the code symbol unit q has a positive (+) value in case that the puncturing over 50% each for the first and second parity sequences is performed. Meantime, q has a negative (−) value in case the puncturing each under 50% for two parity sequences. Thereby, it is used to compute the shifting parameters for each parity sequence.

Another parameter determination process of the preferred embodiments according to the present invention for computing the shifting parameters for the 1st parity sequence provided at is time will now be described.

“N=└N_(C)/3┘; each sequence size for puncturing.

ΔN_(i)=└ΔN/2┘; bit quantity to be punctured for 1st parity sequence where |ΔN| means the amount of puncturing for each column in 1st interleaver.

“ R = ΔN_(i) mod N = N − |ΔN_(i)|; ; if((R≠0)&(2*R≦N)) q = ┌ N/R ┐ else q = ┌N/(R − N)┐ endif if q is even ${{then}\mspace{79mu} q^{\prime}} = {q + \frac{{GCD}\left( {{q},K} \right)}{K}}$ else q′ = q  endif  for(i=0;i<K;i++)  k = |└i*q′┘| mod K  S₁[R[(3k + 1)mod K]] = |└i*q′┘|divK endfor”

A similar procedure is preferably applied to the 2nd parity sequence to calculate the shifting parameter S₂ for 2nd parity sequence.

N=└N_(C)/3┘; each sequence size for puncturing

ΔN_(i)=┌ΔN/2┐; bit quantity to be punctured for 2nd parity sequence where |ΔN| means the amount of puncturing for each column in the 1st interleaver.

“ R = ΔN_(i) mod N = N − |ΔN_(i)|; if((R≠0)&(2*R≦N)) q = ┌ N/R ┐ else q = ┌N/(R − N)┐ endif if q is even ${{then}\mspace{79mu} q^{\prime}} = {q + \frac{{GCD}\left( {{q},K} \right)}{K}}$ else q′ = q  endif  for(i=0;i<K;i++)  k = |└i*q′┘| mod K  S₂[R[(3k + 2)mod K]] = |└i*q′┘|divK endfor”

In two parameter determination algorithms above,

$\,{``{q^{\prime} = {q - \frac{{GCD}\left( {{q},K} \right)}{K}}}"}$ is provided to prevent the puncturing from being continued in the same column, and “k=|└i*q′┘|mod K” indicates a column number on the virtual interleaver. Also, “S₁[R[(3k+1)mod K]]=|└i*q′┘|divK” is the expression showing the procedure of conceptualizing the shifting parameter per each column of the virtual interleaver for the first parity sequence in due order of actual radio frames, and “S₂[R[(3k+2)mod K]]=|└i*q′┘|divK” is the expression representing the procedure of conceptualizing the shifting parameter per each column of the virtual interleaver for the second parity sequence in due order of actual radio frames.

In the above-described procedure, “if((R≠0)&(2*R≦N))” corresponds to a case of the puncturing rate over 50%. That is, considering the case the puncturing occurs over 50%, it is calculated by “R=N−|ΔN_(i)|” as described above. Consequently, when the q value is computed by using the R value, it can be noted that the number of bits not having an occurrence of the puncturing is represented among a length of an overall bit column for virtual interleaver, N, inputted to the rate matching block. In an opposite case, since “R−N=−|ΔN_(i)|” is used in the calculation of the q value, it can be noted that the q value is computed by the actual puncturing number in result.

By using the above procedure for calculating the average puncturing distance q of the code symbol unit for each parity sequence, the absolute value of q always has a larger value than 2. Therefore, a uniformity of the puncturing pattern is maintained according to the preferred embodiments.

For example, assuming that the overall bit column to be rate-matched is constructed by 24 bits, namely, N_(C)=24, and ΔN is −12 by a generation of 50% puncturing for the overall bit column, 6 bits among the first parity sequence constructed by eight bits are punctured, namely the puncturing over 50% is generated. Equally, 6 bits are punctured even for the second parity sequence. In this case, in the parameter determination algorithm for calculating the inventive shifting parameter, it is calculated by the parameter R=N−|ΔN|=8−6=2. Since “R=2” satisfies the condition of “(R≠0)&(2*R≦N)”, the average puncturing distance q of the code symbol unit for the 1st parity sequence becomes “┌8/2┐=4”. In other words, in gaining the average puncturing distance, a bit number not punctured, as 2, is used instead of 6 as a bit number to be punctured. It can be noted that the shifting is performed on the basis of bits not having an occurrence of the puncturing in calculating the shifting values.

FIG. 14 a shows the puncturing pattern on the virtual interleaver for the first parity sequence of the turbo code using the existing shifting parameter computing method. In FIG. 14 a, assume that the overall bit column to be rate-matched is constructed by 24 bits, namely, N_(C)=24, and ΔN is −12 by a generation of 50% puncturing for this overall bit column. As shown in FIG. 14 a, a position not having a generation of the puncturing occurs concentratedly on third and fourth rows and on seventh and eighth rows of the virtual interleaver.

FIG. 14 b represents the puncturing pattern according to the preferred embodiments on the virtual interleaver for the 1st party sequence, which is obtained by using the shifting parameter computing method modified for such a case. As shown in FIG. 14 b, a position not having a generation of the puncturing becomes uniform as possible.

Finally, even though the puncturing over 50% occurs for the each parity sequence, according to preferred embodiments of the present invention, it can be noted that the absolute value of the average puncturing distance q based on the code symbol unit for each parity sequence always has larger value than 2. If a quantity of the puncturing for each parity sequence becomes below 50%, the shifting value gained by the above-described method and the shifting value gotten by the existing method mutually coincide. The puncturing pattern on the virtual interleaver of each party sequence can also gain that same uniform puncturing pattern.

A repetition procedure for the channel code of the uplink will now be described in another preferred embodiment according to the present invention. In the preferred embodiments of the rate matching procedures described above, K used in the parameter determination algorithm is determined as one out of values as 1,2,4 and 8. Also, q′ is not an integer but a multiple of ⅛. The q is a medium parameter for getting the shifting parameter and indicates a mean repetition distance on the overall bit sequence.

In the preferred embodiments of the inventive repetition procedure, further, the shifting parameter per each column is determined by the parameter determination process, after that, a repetition procedure is preferably performed. Different from the puncturing procedure mentioned above, there is no need of performing the separate rate matching repetition to the branched-off coded bit stream. That is the rate matching repetition is performed over the coded bit stream that is not branched off.

The existing parameter determination algorithm is more based on the shifting parameter calculation provided for the sake of the puncturing procedure. Thus, if the existing parameter determination algorithm is applied to the repetition procedure as it is, various problems are caused. For example, a repetition rate considerable for each sequence inputted for a repetition procedure is currently more than 100%. Actually different from the puncturing procedure, there is no explicit upper limit to repetition ratio. When applying the current repetition procedure as it is, some problems occur when the repetition rate exceeds 50%. When the repetition rate is over 50%, in which a first problem is caused in case that the repetition rate exceeds 100%, and a second problem is caused when the repetition rate is neat to 50% together with exceeding 50%.

First, a case where the repetition rate exceeds 100% for each inputted sequence is when the bit number repeated per each column ΔN, is larger than an input sequence size N. In this case, the q value is determined as ‘0’, and therefore, the shifting parameter for the rest other columns excepting of a first column of the 1st interleaver is not allotted. That is, the shifting parameter computation per each column of the 1st interleaver is impossible.

Second, the existing parameter was decided by considering only a case that the repetition rate for the inputted sequences is under 0˜50%, and a case of a repetition a rate exceeding 50% was not considered.

Accordingly, a repetition pattern as shown in FIG. 15 a can occur. FIG. 15 a depicts the repetition pattern provided by using the basic parameter. If the parameter proper to the repetition rate of 51% is calculated by the parameter determination algorithm of computing the shifting parameter provided for the repetition procedure, the average repetition distance of the code symbol unit, q, has a smaller value than 2, as known in “q=└N/|ΔN|┘=└100/51┘”. Finally, “q=1” is applied in the actual algorithm, thereby the slit parameters for all columns of the 1st interleaver are calculated as 0.

In a case of N=11, ΔN=6 and K=8, q becomes 1. Therefore, a finally computed shifting parameter becomes 0 and so the repetition pattern is represented as shown in FIG. 15 a. That is, when it is the repetition rate over 50%, there occur cases that all bits are repeated on some rows and bits are never repeated on some rows, which destroys the uniformity requirements in the sequence before 1st interleaving.

In preferred embodiments according to the present invention for such cases, three methods for setting problems caused in the existed case that the repetition rate exceeds 50% will now be described.

A first method is the following shifting parameter computation procedure provided by considering when the repetition rate is near to 50% together with exceeding 50%. The shifting parameter to be applicable to each 1st interleaver memory column is preferably calculated for sequence inputted to the 1st interleaver, as follows.

“ q = └N / ΔN┘ if(q<=2)  for 1=0 to K−1   S[R[1 mod K]]=(1 mod 2) else if q is even  then q′ = q − GCD(q,K)/K else  q′ = q endif for k=0 to K−1   S[R[┌k* q┐mod K]]= ┌k* q′┐divK end-for”

In such a case that the q value indicating the average repetition distance of the code symbol unit is computed as a value smaller than 2, the shifting parameter allotted per each column is determined as 0 and 1 alternately. In an example, when the input sequence size N is 11, and repeated bit numbers fox the input sequence are determined as ΔN=6 and K=8, the shifting parameter of 0 or 1 per each column is actually applied to the repetition algorithm. Finally, when the repetition rate is approximate to 50% together with exceeding 50%, positions of bits repeated as shown in FIG. 15 b have a uniform repetition pattern on the rest rows excepting of a first row.

However, when the repetition rate is under 50%, the shifting parameter per each column of the virtual interleaver is calculated by “S[R[┌k*q┐mod K]]=┌k*q′┐divK” similar to the existing method, and after that, the uplink repetition algorithm is performed by using the decided parameter value.

In a second method for a case that the repetition rate for the input sequence exceeds 100%, a shifting parameter computation procedure is provided by considering when the bit number ΔN repeated per each column is larger than the input sequence size N. The shifting parameter to be applied to each 1st interleaver memory column is calculated for sequence of the is 1st interleaver, as follows. At this time, a parameter R is defined using the modulo operation, and R is used in computing a medium parameter q representing the average repetition distance overall the coded bit stream.

“ R = |ΔN| mod N  q = └N / R┘ ------- only if R ≠ 0 if q is even  then q′ = q − GCD(q,K)/K else   q′ = q endif for k=0 to K−1   S[R[┌k* q┐mod K]]= ┌k* q′┐divK end-for”

When in the above the input sequence size N is 11 and a repeated bit number ΔN for the input sequence is 13, for example, R is calculated as 2 by “R=ΔN mod N”. According to that, q is computed as 5 by “q └N/R┘”, differently from the existed case that q is calculated as 0.

This value is applied to “S[R[┌k*q┐mod K]]=┌k*q′┐divK” to calculate the shifting parameter per each column of the 1st interleaver, and the uplink repetition algorithm is performed by using such decided parameter value. Finally, in case the repetition rate exceeds 100%, 100% repetition is executed for the inputted sequence. Then, a new q value for deciding the rest bit positions to be repeated is computed. According to that, positions of the rest repeated bits have a uniform repetition pattern by applying the shifting parameter value to the uplink repetition algorithm.

A third method is preferably provided by combining the above fast and second methods. The third method combines the parameter determination procedures for a computation of two shifting parameters, which is applied to the cases that the repetition rate is near to 50% together with exceeding 50% and a bit number ΔN repeated per each column is larger than the input sequence size N.

The shifting parameter to be applied to each 1st interleaver memory column is calculated as follows for sequence inputted to the 1st interleaver. At this time, also, a parameter R is used in computing a medium parameter q representing the average repetition distance of the code symbol unit. In the following procedure, it can be applied even to a case of ‘R=0’. Namely, a case that the repetition rate is 100% or 200%.

 “ R = ΔN mod N  if(R=0) q=1;  else q = └N / ΔN┘ endif  if(q<=2)   for 1=0 to K−1     S[R[1 mod K]] = 1 mod 2  else   if q is even    then q′ = q − GCD(q,K)/K   else    q′ = q  endif  for k=0 to K−1      S[R[┌k* q┐mod K]]= ┌k* q′┐divK  end-for”

The above algorithm is all applicable when the repetition rate is more than 100% available for the current input sequence. If the shifting parameter decided according to that is applied to the uplink repetition algorithm, the repetition pattern in which positions of repeated bits are completely uniform can be obtained.

As described above, the preferred embodiments according to present invention provide various advantages. First, a puncturing having a puncturing distance based on a uniform symbol unit for each parity sequence of RSC coders among puncturing conditions for a turbo code in an uplink can be obtained. Second, a uniform puncturing is embodied even in the uplink to remarkably increase an overall decoding performance, since the puncturing distance of the symbol unit can be designated, using the puncturing algorithm based on the existing bit unit as it is. Third, the uniform puncturing is satisfied regardless of a bit quantity to be punctured. Therefore, the same parameter can be applied thereto and used in the puncturing algorithm for a channel code of an uplink and a downlink.

In addition, when the puncturing for an overall input sequence turbo-coded in the uplink is more than 33.3%, the uniform puncturing condition is satisfied on each column and row of a virtual interleaving pattern. Thus, even in case that each puncturing rate is over 50% on 1st and 2nd parity sequences, the uniform puncturing condition is satisfied on each column and row of a virtual interleaving pattern.

Better pattern performance is obtained in case that the puncturing rate for the turbo-coded overall sequence is over 33.3%. Accordingly, its operation can be performed more smoothly for a limited upper range of the puncturing quantity not only in a normal mode but also in a compressed mode particularly.

According to the preferred embodiments, the shifting parameter per each column of a used interleaving pattern can be calculated even for any repetition rate. Especially, even in case that the repetition rate for the input sequence exceeds 100% and a bit number repeated per each column is larger than an input sequence size, each shifting parameter is again computed, for the rest other columns containing a first column of the interleaving pattern. Accordingly, a uniform repetition pattern can be gained by applying this shifting parameter to an uplink repetition algorithm. Further, in case the repetition rate for the input sequence is near to 50% together with exceeding 50%, the shifting parameter to be applied to the uplink repetition algorithm is computed by using a specifically added function(R). Thereby, a uniform repetition pattern can be obtained on remaining rows excepting of a 1st row according to a characteristic of the repetition algorithm.

The foregoing embodiments and advantages are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. The description of the present invention is intended to be illustrative, and not to limit the scope of the claims. Many alternatives, modifications, and variations will be apparent to those skilled in the art. In the claims, means-plus-faction clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents but also equivalent structures. 

1. A rate matching method for an uplink wireless communication, comprising: calculating an average repetition distance variable value by using a number of an input bit sequence and a number of repetition bits; calculating a shifting parameter for deciding a repetition position per each column of an interleaver to the input bit sequence for interleaving by using the calculated average repetition distance variable value; and performing rate matching to the input bit sequence based on the calculated shifting parameter.
 2. The method according to claim 1, wherein if the calculated average repetition distance variable value does not exceed 2, the step of calculating the shifting parameter alternately determines a shifting parameter value calculating for each column as 0 and
 1. 3. The method according to claim 1, wherein if a rate between the input bit sequence and the number of repetition bits exceeds 100%, the step of calculating the average repetition distance variable value further comprises calculating the variable value from a value obtained by performing a modular operation of the number of repetition bits to the input bit sequence.
 4. The method according to claim 3, wherein if the rate between the input bit sequence and the number of repetition bits is an integral multiple, the step of calculating the average repetition distance variable value decides the variable value as
 1. 5. The method according to claim 1, wherein if a rate between the input bit sequence and the number of repetition bits exceeds 100%, the step of calculating the shifting parameter further comprises calculating a shifting parameter for deciding a bit repetition position per column to the input bit sequence by a number of bits exceeding 100%.
 6. A method of performing rate matching for uplink of a mobile communication system, comprising: encoding an input sequence by a turbo encoder to output coded bits including a systematic bit sequence, a first parity bit sequence, and a second parity bit sequence; configuring a virtual interleaving pattern for each of the first parity bit sequence and the second parity bit sequence; comparing a puncturing rate per column of each virtual interleaving pattern with 50% of a reference puncturing rate; calculating a different puncturing distance q per column of each virtual interleaving pattern, in response to whether the puncturing rate per column is equal to or greater than the reference puncturing rate and whether the puncturing rate per column is less than the reference puncturing rate; calculating a shifting parameter value by using the puncturing distance q; and determining a puncturing position in the virtual interleaving pattern by using the shifting parameter value.
 7. The method according to claim 6, wherein if the puncturing rate is less than the reference puncturing rate, the puncturing distance q has a negative value (−).
 8. The method according to claim 7, wherein the puncturing distance q is a minimum integer equal to or greater than a value of a column length of each virtual interleaving pattern divided by a number of bits to be punctured.
 9. The method according to claim 6, wherein if the puncturing rate is equal to or greater than the reference puncturing rate, the puncturing distance q is a minimum integer equal to or greater than a value of a column length of each virtual interleaving pattern divided by a number of bits not to be punctured.
 10. A method of performing puncturing for rate matching in an wireless communication system, comprising: calculating an average puncturing distance q by using a number of an input bit sequence and a number of bits to be punctured, the input bit sequence including a systematic sequence, a first parity sequence, and a second parity sequence; calculating a shifting parameter for each of the first and second parity sequences, the shifting parameter being determined differently depending on whether the calculated average puncturing distance q is equal to or less than a predetermined value; and performing puncturing for the input bit sequence by using the calculated shifting parameter.
 11. The method according to claim 10, wherein the predetermined value is
 2. 12. The method according to claim 10, wherein performing puncturing for the input bit sequence comprises: calculating an initial offset value for each of the first parity sequence and the second parity sequence by using the shifting parameter; and determining puncturing pattern for each of the first parity sequence and the second parity sequence by using the initial offset value. 